Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
نویسندگان
چکیده
It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound still remains to be the best asymptotical lower bound for LCD codes. In this paper, we show that an algebraic geometry code over a finite field of even characteristic is equivalent to an LCD code and consequently there exists a family of LCD codes that are equivalent to algebraic geometry codes and exceed the asymptotical GV bound.
منابع مشابه
Linear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملOn linear complementary-dual multinegacirculant codes
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index 2 that are LCD are characterized algebraically and some good codes are found in this family. Exact enumeration is performed for indices 2 and 3, and for all indices t for a special case of the co-index by using their concatenated structure. Asymptotic existenc...
متن کاملExplicit Construction of AG Codes from Generalized Hermitian Curves
We present multi-point algebraic geometric codes overstepping the Gilbert-Varshamov bound. The construction is based on the generalized Hermitian curve introduced by A. Bassa, P. Beelen, A. Garcia, and H. Stichtenoth. These codes are described in detail by constrcting a generator matrix. It turns out that these codes have nice properties similar to those of Hermitian codes. It is shown that the...
متن کاملSelf-Dual Codes better than the Gilbert-Varshamov bound
We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any nonprime field $\mathbb F_q$, with $q\geq 64$, except possibly $q=125$, there are self-dual codes better than the asymptotic Gilbert--Varshamov bound.
متن کاملNearly linear time encodable codes beating the Gilbert-Varshamov bound
We construct explicit nearly linear time encodable error-correcting codes beating the Gilbert-Varshamov bound. Our codes are algebraic geometry codes built from the Garcia-Stichtenoth function field tower and beat the Gilbert-Varshamov bound for alphabet sizes at least $19^2$. Messages are identified with functions in certain Riemann-Roch spaces associated with divisors supported on multiple pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.01441 شماره
صفحات -
تاریخ انتشار 2017